#define _CRT_SECURE_NO_WARNINGS 1
#include"Sort.h"
InsertTest()
{
	int a[] = { 3,5,1,6,2,3,7,9,0,8 };

	Print(a, sizeof(a) / sizeof(int));
	InsertSort(a, sizeof(a) / sizeof(int));
	Print(a, sizeof(a) / sizeof(int));

}

void ShellTest()
{
	int a[] = { 3,5,1,6,2,3,7,9,0,8 };

	Print(a, sizeof(a) / sizeof(int));
	ShellSort(a, sizeof(a) / sizeof(int));
	Print(a, sizeof(a) / sizeof(int));

	

}

void SelectTest()
{
	int a[] = { 3,5,1,6,2,3,7,9,0,8 };

	Print(a, sizeof(a) / sizeof(int));
	SelectSort(a, sizeof(a) / sizeof(int));
	Print(a, sizeof(a) / sizeof(int));



}


void HeapTest()
{
	int a[] = { 3,5,1,6,2,3,7,9,0,8 };

	Print(a, sizeof(a) / sizeof(int));
	HeapSort(a, sizeof(a) / sizeof(int));
	Print(a, sizeof(a) / sizeof(int));



}
void BullbleTest()
{
	int a[] = {1,2,3,4,5,6,7,8,9 };

	Print(a, sizeof(a) / sizeof(int));
	BullbleSort(a, sizeof(a) / sizeof(int));
	Print(a, sizeof(a) / sizeof(int));



}
void QuickTest()
{
	int a[] = { 3,5,1,6,2,3,7,9,0,8 };

	Print(a, sizeof(a) / sizeof(int));
	QuickSort4(a,0, sizeof(a) / sizeof(int)-1);
	Print(a, sizeof(a) / sizeof(int));



}
void MergeTest()
{
	int a[] = { 3,5,1,6,2,3,7,9,0,8 };

	Print(a, sizeof(a) / sizeof(int));
	MergeSortNon(a, sizeof(a) / sizeof(int));
		Print(a, sizeof(a) / sizeof(int));



}
void CountTest()
{
	int a[] = { 3,5,1,6,2,3,7,9,0,8 };

	Print(a, sizeof(a) / sizeof(int));
	CountSort(a, sizeof(a) / sizeof(int));
	Print(a, sizeof(a) / sizeof(int));



}

int main()
{
	//InsertTest();
	//ShellTest();
	//SelectTest();
	//HeapTest();
	//BullbleTest();
	//QuickTest();
	//MergeTest();
	CountTest();

	return 0;
}